A Note on Backward Induction, Iterative Elimination of Weakly Dominated Strategies, and Voting in Binary Agendas

نویسنده

  • John Duggan
چکیده

Finite perfect information extensive (FPIE) games are quite well-understood: backward induction yields all of the pure strategy subgame perfect equilibria of such games. Iterative elimination of weakly dominated strategies (IEWDS), which can be hazardous in general games due to orderdependence of outcomes, can be much better behaved. In fact, for a large class of FPIE games, the outcomes of IEWDS match quite well with the outcomes of backward induction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Division of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 Finite Perfect Information Extensive Games with Generic Payoffs

In nite perfect information extensive (FPIE) games, backward induction (BI) gives rise to all pure-strategy subgame perfect Nash equilibria, and iterative elimination of weakly dominated strategies (IEWDS) may give di erent outcomes for di erent orders of elimination. Duggan recently posed several conjectures in an e ort to better understand the relationship between BI and IEWDS in FPIE games. ...

متن کامل

Weakly Dominated Strategies: a Mystery Cracked

An informal argument shows that common knowledge of rationality implies the iterative elimination of strongly dominated strategies. Rationality here means that players do not play strategies that are strongly dominated relative to their knowledge. We formalize and prove this claim. When by rationality we mean that players do not play strategies that are weakly dominated relative to their knowle...

متن کامل

Weak Dominance: a Mystery Cracked

What strategy profiles can be played when it is common knowledge that weakly dominated strategies are not played? A comparison to the case of strongly dominated strategy is in order. A common informal argument shows that if it is common knowledge that players do not play strongly dominated strategies then players can play only profiles that survive the iterative elimination of strongly dominate...

متن کامل

Weakly Dominated Strategies: a Mystery Cracked

An informal argument shows that common knowledge of rationality implies the iterative elimination of strongly dominated strategies. Rationality here means that players do not play strategies that are strongly dominated relative to their knowledge. We formalize and prove this claim. When by rationality we mean that players do not play strategies that are weakly dominated relative to their knowle...

متن کامل

Weakly Dominated Strategies: a Mystery Cracked

An informal argument shows that common knowledge of rationality implies the iterative elimination of strictly dominated strategies. Rationality here means that players do not play strategies that are strictly dominanted relative to their knowledge. We formalize and prove this claim. When by rationality we mean that players do not play strategies that are weakly dominanted relative to their know...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003